Uniquely and faithfully embeddable projective-planar triangulations
نویسندگان
چکیده
منابع مشابه
A note on uniquely embeddable forests
Let F be a forest of order n. It is well known that if F 6= Sn, a star of order n, then there exists an embedding of F into its complement F . In this note we consider a problem concerning the uniqueness of such an embedding.
متن کاملA note on uniquely embeddable graphs
Let G be a simple graph of order n and size e(G). It is well known that if e(G) ≤ n−2, then there is an embedding G into its complement G. In this note, we consider a problem concerning the uniqueness of such an embedding.
متن کاملTriangulations of Projective Modules
We show that the category of projective modules over a graded commutative ring admits a triangulation with respect to module suspension if and only if the ring is a finite product of graded fields and exterior algebras on one generator over a graded field (with a unit in the appropriate degree). We also classify the ungraded commutative rings for which the category of projective modules admits ...
متن کاملClin d’oeil on Lj-embeddable planar graphs
In this note we present some properties of LI-embeddable planar graphs. We present a characterization of graphs isometrically embeddable into half-cubes. This result implies that every planar Li-graph G has a scale 2 embedding into a hypercube. Further, under some additional conditions we show that for a simple circuit C of a planar Li-graph G the subgraph H of G bounded by C is also Li-embedda...
متن کاملPlanar Minimum-Weight Triangulations
The classic problem of nding a minimum-weight triangulation for a given planar straight-line graph is considered in this paper. A brief overview of known methods is given in addition to some new results. A parallel greedy triangulation algorithm is presented along with experimental data that suggest a logarithmic relationship between the number of input vertices and its running time in the aver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1984
ISSN: 0095-8956
DOI: 10.1016/0095-8956(84)90024-8